Enumeration of labelled chain graphs and labelled essential directed acyclic graphs

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Asymptotic Enumeration of Labelled Graphs by Genus

We obtain asymptotic formulas for the number of rooted 2-connected and 3connected surface maps on an orientable surface of genus g with respect to vertices and edges simultaneously. We also derive the bivariate version of the large facewidth result for random 3-connected maps. These results are then used to derive asymptotic formulas for the number of labelled k-connected graphs of orientable g...

متن کامل

- Algebras of Labelled Graphs

We describe a class of C *-algebras which simultaneously generalise the ul-tragraph algebras of Tomforde and the shift space C *-algebras of Matsumoto. In doing so we shed some new light on the different C *-algebras that may be associated to a shift space. Finally, we show how to associate a simple C *-algebra to an irreducible sofic shift.

متن کامل

Evacuation of labelled graphs

In this note, we extend Schiitzenberger’s evacuation of Young tableaux (Schtitzenberger, 1963), and naturally labelled posets (Schltzenberger, 1972), to labelled graphs. It is shown that evacuation is an involution, and that in that in the dual evacuation, tracks and trajectories are interchanged. Let G = ( V, E) be a simple undirected graph without loops; V is its set of vertices, and E its se...

متن کامل

MSO zero-one laws on random labelled acyclic graphs

We use Ehrenfeucht-type games to prove that Monadic Second Order logic admits labelled zero-one laws for random free trees, generating the complete almost sure theory. Our method will be to dissect random trees to get a picture of what almost all random free trees look like. We will use elementary (second moment) methods to obtain probability results. Abstract Key words: random labelled trees, ...

متن کامل

C∗-algebras of Labelled Graphs

We describe a class of C∗-algebras which simultaneously generalise the ultragraph algebras of Tomforde and the shift space C∗-algebras of Matsumoto. In doing so we shed some new light on the different C∗-algebras that may be associated to a shift space. Finally, we show how to associate a simple C∗-algebra to an irreducible sofic shift. keywords: C∗-algebras, labelled graph, ultragraph, Matsumo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2003

ISSN: 0012-365X

DOI: 10.1016/s0012-365x(02)00838-5